Fault-Tolerant Metric Dimension of Cube of Paths
نویسندگان
چکیده
منابع مشابه
Fault-tolerant cube graphs and coding theory
Hypercubes, meshes, tori and Omega networks are well known interconnection networks for parallel computers. The structure of those graphs can be described in a more general framework called cube graphs. The idea is to assume that every node in a graph with q ` nodes is represented by a unique string of`symbols over GF (q). The edges are speciied by a set of oosets, those are vectors of lengthòv...
متن کاملFault-Tolerant Metric Vector Routing
We present a distributed routing protocol for obtaining the best path between any pair of nodes in a computer network. The metric to determine the best path between the two nodes is an n-dimensional vector. Each element of the vector is a simple metric, such as hop-count, link cost, link bandwidth, etc.. Given that no path may provide the best value for each of the simple metrics in the vector,...
متن کاملFault-Tolerant Routing and Disjoint Paths in Dual-Cube: A New Interconnection Network
In this paper, we introduce a new interconnection network, the dual-cube, its topological properties, and the routing/broadcasting algorithms in the dual-cube. The advanced subjects such as fault-tolerant routing and constructing multiple disjoint paths in dual-cubes are also included in this paper. The binary hypercube, or r-cube, can connect 2r nodes. In contrast, a dual-cube with r links for...
متن کاملFault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks
Fault-tolerant hamiltonicity and faulttolerant hamiltonian connectivity of the folded Petersen cube networks Cheng-Kuan Lin a , Tung-Yang Ho b , Jimmy J.M. Tan a & Lih-Hsing Hsu c a Department of Computer Science , National Chiao Tung University , Hsinchu, Taiwan, Republic of China b Department of Industrial Engineering and Management , Ta Hwa Institute of Technology , Hsinchu, Taiwan, Republic...
متن کاملVertex-Fault-Tolerant Hamiltonicity of Cube-Connected Cycles Graphs
The graph CCCn has n × 2 vertices, labeled (l,x), where l is an integer between 0 and n − 1 and x is an n-bit binary string. Two vertices (l,x) and (l′,y) are adjacent if and only if either x = y and |l − l′| = 1, or l = l′ and y = (x). A graph G is called k-vertex-fault-tolerant hamiltonian if it remains hamiltonian after removing at most k vertices. In this paper, we will prove that CCCn is 1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1714/1/012029